Dimension Reduction Techniques for ℓp (1<p<2), with Applications

For Euclidean space (`2), there exists the powerful dimension reduction transform of Johnson and Lindenstrauss [26], with a host of known applications. Here, we consider the problem of dimension reduction for all `p spaces 1 ≤ p ≤ 2. Although strong lower bounds are known for dimension reduction in `1, Ostrovsky and Rabani [40] successfully circumvented these by presenting an `1 embedding that maintains fidelity in only a bounded distance range, with applications to clustering and nearest neighbor search. However, their embedding techniques are specific to `1 and do not naturally extend to other norms. In this paper, we apply a range of advanced techniques and produce bounded range dimension reduction embeddings for all of 1 ≤ p ≤ 2, thereby demonstrating that the approach initiated by Ostrovsky and Rabani for `1 can be extended to a much more general framework. We also obtain improved bounds in terms of the intrinsic dimensionality. As a result we achieve improved bounds for proximity problems including snowflake embeddings and clustering. 1998 ACM Subject Classification F.2 Analysis of Algorithms and Problem Complexity